Convergence analysis of the preconditioned Gauss-Seidel method for H-matrices

نویسندگان

  • Qingbing Liu
  • Guoliang Chen
  • Jing Cai
چکیده

113–123] proved that the convergence rate of the preconditioned Gauss–Seidel method for irreducibly diagonally dominant Z-matrices with a preconditioner I + S α is superior to that of the basic iterative method. In this paper, we present a new preconditioner I + K β which is different from the preconditioner given by Kohno et al. and prove the convergence theory about two preconditioned iterative methods when the coefficient matrix is an H-matrix. Meanwhile, two novel sufficient conditions for guaranteeing the convergence of the preconditioned iterative methods are given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems

Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...

متن کامل

Preconditioned Gauss-seidel Iterative Method for Z-matrices Linear Systems

For Ax = b, it has recently been reported that the convergence of the preconditioned Gauss-Seidel iterative method which uses a matrix of the type P = I + S (α) to perform certain elementary row operations on is faster than the basic Gauss-Seidel method. In this paper, we discuss the adaptive Gauss-Seidel iterative method which uses P = I + S (α) + K̄ (β) as a preconditioner. We present some com...

متن کامل

Preconditioning for solving Hermite Collocation by the Bi-CGSTAB

Explicit pre/post conditioning of the large, sparse and non-symmetric system of equations, arising from the discretization of the Dirichlet Poisson’s Boundary Value Problem (BVP) by the Hermite Collocation method is the problem considered herein. Using the 2-cyclic (red-black) structure of the Collocation coefficient matrix, we investigate the eigenvalue distribution of its preconditioned analo...

متن کامل

Convergence and Comparison Theorems of the Modified Gauss-Seidel Method

In this paper, the modified Gauss-Seidel method with the new preconditioner for solving the linear system Ax = b, where A is a nonsingular M -matrix with unit diagonal, is considered. The convergence property and the comparison theorems of the proposed method are established. Two examples are given to show the efficiency and effectiveness of the modified Gauss-Seidel method with the presented n...

متن کامل

A Modified Aor-type Iterative Method for L-matrix Linear Systems

Both Evans et al. and Li et al. have presented preconditioned methods for linear systems to improve the convergence rates of AOR-type iterative schemes. In this paper, we present a new preconditioner. Some comparison theorems on preconditioned iterative methods for solving L-matrix linear systems are presented. Comparison results and a numerical example show that convergence of the precondition...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Mathematics with Applications

دوره 56  شماره 

صفحات  -

تاریخ انتشار 2008